An Approach Based on Genetic and Grasshopper Optimization Algorithms for Dynamic Load Balancing in CloudIoT
نویسندگان
چکیده
CloudIoT is a new paradigm, which has emerged as result of the combination Cloud Computing (CC) and Internet Things (IoT). It experienced growing rapid development, it become more popular in information technology (IT) environments because advantages offers. However, due to strong use this especially smart cities, problem imbalance load emerged. Indeed, satisfy needs user, intelligent objects send collected data virtual machines (VMs) cloud order be processed. So, necessary have an idea about its VM. Thus, balancing between VMs strongly related technique used for selection. To tackle problem, we propose paper task scheduler called Scheduler Genetic Grasshopper Algorithm (SGGA). allows ensure dynamic balancing, well optimization makespan resource usage. Our proposed SGGA based on (GA) Optimization (GOA). First, tasks sent by IoTs are mapped build initial population, then performs genetic algorithm, expressed considerable performance. weakness GA marked heaviness caused mutation operator, when number increases. Because insufficiency, replaced operator with grasshopper algorithm. The results experiments show that our approach (SGGA) most efficient, compared recent approaches, terms response time obtain optimal solution, makespan, throughput, average utilization rate hypervolume indicator.
منابع مشابه
Observations on Using Genetic Algorithms for Dynamic Load-Balancing
ÐLoad-balancing problems arise in many applications, but, most importantly, they play a special role in the operation of parallel and distributed computing systems. Load-balancing deals with partitioning a program into smaller tasks that can be executed concurrently and mapping each of these tasks to a computational resource such a processor (e.g., in a multiprocessor system) or a computer (e.g...
متن کاملOn Simple Algorithms for Dynamic Load Balancing
This paper focuses on the dynamic resource allocation problem. In communication networks such as wireless or circuit switching networks, resources correspond to base stations or links, and the load corresponds to the calls in the network. The principle of load balancing is examined for dynamic resource allocation. The question of interest is the performance of simple allocation strategies which...
متن کاملAccelerated diffusion algorithms for dynamic load balancing
We consider the load balancing problem for a synchronous distributed processor network. The processor network is modeled by an undirected, connected graph G = (V,E) in which node vi ∈ V possesses a computational load wi. We want to determine a schedule in order to move load across edges so that the weight on each node is approximately equal. This problem models load balancing when we associate ...
متن کاملDynamic Load Balancing Algorithms for Sequence Mining
Discovery of sequential patterns is becoming increasingly useful and essential in many scienti c and commercial domains. Enormous sizes of available datasets and possibly large number of mined patterns demand e cient and scalable algorithms. In this paper we present a parallel formulation of a serial sequential pattern discovery algorithm based on tree projection that uses a novel dynamic load ...
متن کاملapplication of swarm-based optimization algorithms for solving dynamic economic load dispatch problem
dynamic economic load dispatch is one of the most important roles of power generation’s operation and control. it determines the optimal controls of production of generator units with predicted load demand over a certain period of time. economic dispatch at minimum production cost is one of the most important subjects in the power network’s operation, which is a complicated nonlinear constraine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing and informatics
سال: 2023
ISSN: ['1335-9150', '2585-8807']
DOI: https://doi.org/10.31577/cai_2023_2_364